Probabilistic game automata
نویسندگان
چکیده
منابع مشابه
Probabilistic Game Automata
We define a probabilistic game automaton, a general model of a two-person game. We show how this model includes as special cases the games against nature of Papadimitriou [13], the Arthur-Merlin games of Babai [ 11, and the interactive proof systems of Goldwasser, Micah, and Rackoff [7]. We prove a number of results about another special case, games against unknown nature, which is a generaliza...
متن کاملAlgorithmic probabilistic game semantics - Playing games with automata
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin’s probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the...
متن کاملGame Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking ...
متن کاملParameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
We propose a symbolic method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised. Our first algorithm, based on forward exploration of the symbolic states, can only guarantee parameter values that correspond to upper (resp. lower) bounds on maximum (resp. minimum) re...
متن کاملProbabilistic Reversible Automata and Quantum Automata
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90038-4